Compound Poisson Disorder Problems with Nonlinear Detection Delay Penalty Cost Functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compound Poisson Disorder Problems with Nonlinear Detection Delay Penalty Cost Functions

The quickest detection of the unknown and unobservable disorder time, when the arrival rate and mark distribution of a compound Poisson process suddenly changes, is formulated in a Bayesian setting, where the detection delay penalty is a general smooth function of the detection delay time. Under suitable conditions, the problem is shown to be equivalent to the optimal stopping of a finite-dimen...

متن کامل

Poisson Disorder Problem with Exponential Penalty for Delay

We solve the Poisson disorder problem when the delay is penalized exponentially. Our objective is to detect as quickly as possible the unobservable time of the change (or disorder) in the intensity of a Poisson process. The disorder time delimits two different regimes in which one employs distinct strategies (e.g., investment, advertising, manufacturing). We seek a stopping rule that minimizes ...

متن کامل

Compound Poisson Disorder Problem

In compound Poisson disorder problem, arrival rate and/or jump distribution of some compound Poisson process change suddenly at some unknown and unobservable time. The problem is to detect the change (or disorder) time as quickly as possible. A sudden regime-shift may require some counter-measures be taken promptly, and a quickest detection rule can help with those efforts. We describe complete...

متن کامل

Exact Penalty Functions for Nonlinear Integer Programming Problems

Abstract In this work, we study exact continuous reformulations of nonlinear integer programming problems. To this aim, we preliminarily state conditions to guarantee the equivalence between pairs of general nonlinear problems. Then, we prove that optimal solutions of a nonlinear integer programming problem can be obtained by using various exact penalty formulations of the original problem in a...

متن کامل

Single Facility Goal Location Problems with Symmetric and Asymmetric Penalty Functions

Location theory is an interstice field of optimization and operations research‎. ‎In the classic location models‎, ‎the goal is finding the location of one or more facilities such that some criteria such as transportation cost‎, ‎the sum of distances passed by clients‎, ‎total service time, and cost of servicing are minimized‎. ‎The goal Weber location problem is a special case of location mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sequential Analysis

سال: 2010

ISSN: 0747-4946,1532-4176

DOI: 10.1080/07474941003741227